Implementation of the method of figurative transformations to minimizing symmetric Boolean functions

This paper reports a study that has established the possibility of improving effectiveness method figurative transformations in order to minimize symmetrical Boolean functions main and polynomial bases. Prospective reserves analytical were identified, such as simplification function conjuncterms using created equivalent based on inserting same followed by operation super-gluing variables. The was extended process minimizing with help algebra terms rules for simplifying bases developed conjuncterms. It symmetric is flowchart repetition, which actual truth table assigned function. sufficient resource makes it possible do without auxiliary objects, Karnaugh maps, cubes, etc. perfect normal form can be represented binary matrices would represent OR or XOR them. experimental confirmed employs 2-(n, b)-design, x/b)-design combinatorial systems improves efficiency functions. Compared analogs, this enhance productivity 100‒200 %. There are grounds assert transformations. ensured, particular, similar